Automatic case acquisition from texts for process-oriented case-based reasoning

This paper introduces a method for the automatic acquisition of a rich case representation from free text for process-oriented case-based reasoning. Case engineering is among the most complicated and costly tasks in implementing a case-based reasoning system. This is especially so for process-oriented case-based reasoning, where more expressive case representations are generally used and, in our opinion, actually required for satisfactory case adaptation. In this context, the ability to acquire cases automatically from procedural texts is a major step forward in order to reason on processes. We therefore detail a methodology that makes case acquisition from processes described as free text possible, with special attention given to assembly instruction texts. This methodology extends the techniques we used to extract actions from cooking recipes. We argue that techniques taken from natural language processing are required for this task, and that they give satisfactory results. An evaluation based on our implemented prototype extracting workflows from recipe texts is provided.Comment: Sous presse, publication pr\'evue en 201

Case Adaptation with Qualitative Algebras

This paper proposes an approach for the adaptation of spatial or temporal cases in a case-based reasoning system. Qualitative algebras are used as spatial and temporal knowledge representation languages. The intuition behind this adaptation approach is to apply a substitution and then repair potential inconsistencies, thanks to belief revision on qualitative algebras. A temporal example from the cooking domain is given. (The paper on which this extended abstract is based was the recipient of the best paper award of the 2012 International Conference on Case-Based Reasoning.

Belief revision in the propositional closure of a qualitative algebra

Belief revision is an operation that aims at modifying old be-liefs so that they become consistent with new ones. The issue of belief revision has been studied in various formalisms, in particular, in qualitative algebras (QAs) in which the result is a disjunction of belief bases that is not necessarily repre-sentable in a QA. This motivates the study of belief revision in formalisms extending QAs, namely, their propositional clo-sures: in such a closure, the result of belief revision belongs to the formalism. Moreover, this makes it possible to define a contraction operator thanks to the Harper identity. Belief revision in the propositional closure of QAs is studied, an al-gorithm for a family of revision operators is designed, and an open-source implementation is made freely available on the web

Evaluating a textual adaptation system

International audienceThis paper presents a CBR method to retrieve and adapt processes represented as instruction texts, as well as the evaluation methodology that we developed to evaluate it. The evaluation process is user-based, blind and comparative. It is less labour intensive than most existing approaches and is more open to a variety of possible solutions to the same query, among other benefits. It also makes it possible to evaluate separately the textual adaptation process and the underlying formal adaptation process

Extension du formalisme des flux opérationnels par une algèbre temporelle

National audienceWorkflows constitute an important language to represent knowledge about processes, but also increasingly to reason on such knowledge. On the other hand, there is a limit to which time constraints between activities can be expressed. Qualitative interval algebras can model processes using finer temporal relations, but they cannot reproduce all workflow patterns. This paper defines a common ground model-theoretical semantics for both workflows and interval algebras, making it possible for reasoning systems working with either to interoperate. Thanks to this, interesting properties and inferences can be defined, both on workflows and on an extended formalism combining workflows with interval algebras. Finally, similar formalisms proposing a sound formal basis for workflows and extending them are discussed.Les flux opérationnels (workflows) constituent un important langage de représentation des connaissances sur les processus, mais sont également de plus en plus utilisés pour raisonner sur ce type de connaissances. En revanche, ils sont limités pour l'expression de contraintes temporelles entre activités. Les algèbres qualitatives d'intervalles peuvent représenter des relations temporelles plus fines, mais elles sont incapables de reproduire toutes les structures de contrôle des flux. Cet article définit une sémantique, fondée sur la théorie des modèles, commune aux flux opérationnels et aux algèbres d'intervalles, rendant possible l'inter-opérabilité de systèmes de raisonnement utilisant ces deux formalismes. Cela met également en évidence des propriétés et des possibilités d'inférences intéressantes, à la fois pour les flux opérationnels et pour les flux étendus par l'utilisation d'une algèbre qualitative. Finalement, nous discutons de formalismes similaires, proposant également une base théorique au formalisme des flux et étendant ce dernier

Quels formalismes temporels pour représenter des connaissances extraites de textes de recettes de cuisine ?

National audienceThe Taaable projet goal is to create a case-based reasoning system for retrieval and adaptation of cooking recipes. Within this framework, we are discussing the temporal aspects of recipes and the means of representing those in order to adapt their text.Le projet Taaable a pour objet de construire un système de raisonnement à partir de cas pour la recherche et l'adaptation de textes de recettes de cuisine. Dans ce cadre, nous nous intéressons aux aspects temporels des recettes et à la manière de les représenter afin d'en envisager l'adaptation textuelle

Semi-automatic annotation process for procedural texts: An application on cooking recipes

Taaable is a case-based reasoning system that adapts cooking recipes to user constraints. Within it, the preparation part of recipes is formalised as a graph. This graph is a semantic representation of the sequence of instructions composing the cooking process and is used to compute the procedure adaptation, conjointly with the textual adaptation. It is composed of cooking actions and ingredients, among others, represented as vertices, and semantic relations between those, shown as arcs, and is built automatically thanks to natural language processing. The results of the automatic annotation process is often a disconnected graph, representing an incomplete annotation, or may contain errors. Therefore, a validating and correcting step is required. In this paper, we present an existing graphic tool named \kcatos, conceived for representing and editing decision trees, and show how it has been adapted and integrated in WikiTaaable, the semantic wiki in which the knowledge used by Taaable is stored. This interface provides the wiki users with a way to correct the case representation of the cooking process, improving at the same time the quality of the knowledge about cooking procedures stored in WikiTaaable

Adaptation de cas spatiaux et temporels

National audienceQualitative algebras form a family of languages mainly used to represent knowledge depending on space or time. This paper proposes an approach to adapt cases represented in such an algebra. A spatial example in agronomy and a temporal example in cooking are given. The idea behind this adaptation approach is to apply a substitution and then repair potential inconsistencies, thanks to belief revision on qualitative algebras.Les algèbres qualitatives forment une famille de langages utilisés principalement pour représenter des connaissances de nature temporelle ou spatiale. Cet article propose une approche pour adapter des cas représentés dans une telle algèbre. Un exemple spatial portant sur l'agronomie ainsi qu'un exemple temporel portant sur la cuisine sont donnés. L'idée sous-jacente à cette approche de l'adaptation est d'appliquer une substitution puis de réparer les incohérences qui pourraient être apparues, grâce à la révision des croyances appliquée aux algèbres qualitatives